Covering graph

Results: 53



#Item
21Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface∗ ´ COLIN DE VERDIERE ` Eric

Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface∗ ´ COLIN DE VERDIERE ` Eric

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2007-08-01 04:08:14
22TIGHTENING NONSIMPLE PATHS AND CYCLES ON SURFACES∗ † AND JEFF ERICKSON‡ ´ ` ERIC COLIN DE VERDIERE

TIGHTENING NONSIMPLE PATHS AND CYCLES ON SURFACES∗ † AND JEFF ERICKSON‡ ´ ` ERIC COLIN DE VERDIERE

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-12-17 04:55:56
23CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014  Covering Grids by Trees Adrian Dumitrescu∗  Abstract

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Grids by Trees Adrian Dumitrescu∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-06-18 11:48:20
24On the Complexity of Nondeterministically Testable Hypergraph Parameters Marek Karpinski∗ Roland Markó†

On the Complexity of Nondeterministically Testable Hypergraph Parameters Marek Karpinski∗ Roland Markó†

Add to Reading List

Source URL: theory.cs.uni-bonn.de

Language: English - Date: 2015-03-25 03:59:26
25Hardness of the Covering Radius Problem on Lattices

Hardness of the Covering Radius Problem on Lattices

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2012-12-09 15:48:28
26arXiv:1503.07093v1  [cs.DS]  24 Mar 2015

arXiv:1503.07093v1 [cs.DS] 24 Mar 2015

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-03-24 20:35:51
27A COVERING-GRAPH APPROACH TO EPIDEMICS ON SIS AND SIS-LIKE NETWORKS WILLIAM FLOYD, LESLIE KAY, AND MICHAEL SHAPIRO Abstract. In this paper we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I)

A COVERING-GRAPH APPROACH TO EPIDEMICS ON SIS AND SIS-LIKE NETWORKS WILLIAM FLOYD, LESLIE KAY, AND MICHAEL SHAPIRO Abstract. In this paper we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I)

Add to Reading List

Source URL: www.math.vt.edu

Language: English - Date: 2011-05-24 09:05:15
28NONPOSITIVE CURVATURE AND PARETO-OPTIMAL COORDINATION OF ROBOTS∗ ROBERT GHRIST† AND STEVEN M. LAVALLE‡ Abstract. Given a collection of robots sharing a common environment, assume that each possesses a graph (a 1-d

NONPOSITIVE CURVATURE AND PARETO-OPTIMAL COORDINATION OF ROBOTS∗ ROBERT GHRIST† AND STEVEN M. LAVALLE‡ Abstract. Given a collection of robots sharing a common environment, assume that each possesses a graph (a 1-d

Add to Reading List

Source URL: msl.cs.uiuc.edu

Language: English - Date: 2006-02-01 12:22:02
29Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface∗ ´ COLIN DE VERDIERE ` Eric

Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface∗ ´ COLIN DE VERDIERE ` Eric

Add to Reading List

Source URL: www.gipsa-lab.grenoble-inp.fr

Language: English - Date: 2010-01-05 10:36:32
30DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o

DIHEDRAL COVERS OF THE COMPLETE GRAPH K5 M. GHASEMI Abstract. A regular cover of a connected graph is called dihedral if its transformation group is dihedral. In this paper, the author classifies all dihedral coverings o

Add to Reading List

Source URL: www.kurims.kyoto-u.ac.jp

Language: English - Date: 2014-05-27 07:51:07